Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
نویسندگان
چکیده
منابع مشابه
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
In this paper we propose an approach for solving problems of optimal resource capacity allocation to a collection of stochastic dynamic competitors. In particular, we introduce the knapsack problem for perishable items, which concerns the optimal dynamic allocation of a limited knapsack to a collection of perishable or non-perishable items. We formulate the problem in the framework of Markov de...
متن کاملOptimal Dynamic Promotion and the Knapsack Problem for Perishable Items (Extended Abstract)
Senior managers in retail industry make important decisions upon assortment planning, product pricing, and product promotion. While product assortment is a strategic decision taken over a long-term planning period (Kök et al., 2006), the latter two are both strategic and tactical: they can be used in dayto-day marketing decisions to dynamically adjust to demand variations. Within the food retai...
متن کاملThe Dynamic and Stochastic Knapsack Problem
The Dynamic and Stochastic Knapsack Problem (DSKP) is de ned as follows: Items arrive according to a Poisson process in time. Each item has a demand (size) for a limited resource (the knapsack) and an associated reward. The resource requirements and rewards are jointly distributed according to a known probability distribution and become known at the time of the item's arrival. Items can be eith...
متن کاملTime-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the pspace-hard restless bandit problem and the np-hard knapsack problem. Our main result is a problem decomposition method resu...
متن کاملTime-Constrained Restless Bandits and the Knapsack Problem for Perishable Items
Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly. The KPPI naturally bridges the gap and elucidates the relation between the pspace-hard restless bandit problem and the np-hard knapsack problem. Our main result is a problem decomposition method resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2013
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-013-1312-9